Negation in the Logic of First Degree Entailment and Tonk

نویسنده

  • Shahid Rahman
چکیده

The dialogical framework is an approach to meaning that provides an alternative to both the model-theoretical and the proof-theoretical semantics. The dialogical approach to logic is not a logic but a semantic rule-based framework where different logics could be developed, combined or compared. But are there any constraints? Can we introduce rules ad libitum to define whatever logical constant? In the present paper I will explore the first conceptual moves towards the notion of Dialogical Harmony. Crucial for the dialogical approach are the following points 1. The distinction between local (rules for logical constants) and global meaning (included in the structural rules) 2. The player independence of local meaning 3. The distinction between the play level (local winning or winning of a play) and the strategic level (global winning; or existence of a winning strategy). 4. A notion of validity that amounts to winning strategy independently of any model instead of winning strategy for every model. 5. The notion of winning in a formal play instead of winning strategy in a model. In order to highlight these specific features of the dialogical approach to meaning I will discuss the dialogical analysis of tonk, some tonk-like operators and the negation of the logic of first-degree entailment . 1 [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

On the complexity of entailment in existential conjunctive first-order logic with atomic negation

We consider the entailment problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted FOL(∃,∧,¬a). This problem can be recast as several fundamental problems in artificial intelligence and databases, namely query containment for conjunctive queries with negation, clause entailment for clauses without functions and qu...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

A Tableau Calculus for Equilibrium Entailment

We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics underyling equilibrium entailment, namely hereand-there with strong negation and its strengthening classica...

متن کامل

Reasoning about Minimal Belief and Negation as Failure

We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012